Fast algorithms for approximate Fréchet matching queries in geometric trees
نویسندگان
چکیده
منابع مشابه
Fast algorithms for approximate Fréchet matching queries in geometric trees
Let T be a tree in Rd and let ∆ > 0 be a real number. The aim is to preprocess T into a data structure, such that for any polygonal query path Q, we can decide if T contains a path P whose Fréchet distance δF (Q,P ) to Q is at most ∆. For any real number ε > 0, we present an efficient data structure that solves an approximate version of this problem for the case when T is c-packed and each of t...
متن کاملFréchet Queries in Geometric Trees
Let T be a tree that is embedded in the plane and let ∆ > 0 be a real number. The aim is to preprocess T into a data structure, such that, for any query polygonal path Q, we can decide if T contains a path P whose Fréchet distance δF (P,Q) to Q is less than ∆. For any real number ε > 0, we present an efficient data structure that solves an approximate version of this problem, for the case when ...
متن کاملFast Bayesian Shape Matching Using Geometric Algorithms
We present a Bayesian approach to comparison of geometric shapes with applications to classification of the molecular structures of proteins. Our approach involves the use of distributions defined on transformation invariant shape spaces and the specification of prior distributions on bipartite matchings. Here we emphasize the computational aspects of posterior inference arising from such model...
متن کاملFast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem has increased dramatically because of the prevalence of the Web. In this paper, we aim to explore the efficient top-k similar string matching problem. Several efficient strategies are introduced, such as length aware a...
متن کاملApproximate Geometric MST Range Queries
Range searching is a widely-used method in computational geometry for efficiently accessing local regions of a large data set. Typically, range searching involves either counting or reporting the points lying within a given query region, but it is often desirable to compute statistics that better describe the structure of the point set lying within the region, not just the count. In this paper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2015
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2015.02.003